Application of braiding sequences IV: link polynomials and geometric invariants
نویسندگان
چکیده
Nous appliquons le concept de séquences tressage aux polynômes skein et Conway, mais aussi à quelques invariants géométriques des entrelacs positifs. On donne estimations pour l’indice tresses legendriens, en utilisant degré propriétés croissance coefficients du polynôme Conway. énumérons asymptotiquement une constante près les alternants (et autres) genre donné par leur indice tresses.
منابع مشابه
Gauss Sum Invariants, Vassiliev Invariants and Braiding Sequences
We introduce a new approach to Vassiliev invariants. This approach deals with Vassiliev invariants directly on knots and does not make use of diagrams. We give a series of applications of this approach, (re)proving some new and known facts on Vassiliev invariants.
متن کاملOn Finiteness of Vassiliev Invariants and a Proof of the Lin-wang Conjecture via Braiding Polynomials
Using the new approach of braiding sequences we give a proof of the Lin-Wang conjecture, stating that a Vassiliev invariant v of degree k has a value Ov(c(K)k) on a knot K, where c(K) is the crossing number of K and Ov depends on v only. We extend our method to give a quadratic upper bound in k for the crossing number of alternating/positive knots, the values on which suffice to determine uniqu...
متن کاملBraiding via Geometric Lie Algebra Actions
We introduce the idea of a geometric categorical Lie algebra action on derived categories of coherent sheaves. The main result is that such an action induces an action of the braid group associated to the Lie algebra. The same proof shows that strong categorical actions in the sense of Khovanov-Lauda and Rouquier also lead to braid group actions. As an example, we construct an action of Artin’s...
متن کاملTutte Polynomials and Link Polynomials
We show how the Tutte polynomial of a plane graph can be evaluated as the "homfly" polynomial of an associated oriented link. Then we discuss some consequences for the partition function of the Potts model, the Four Color Problem and the time complexity of the computation of the homfly polynomial.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annales de l'Institut Fourier
سال: 2021
ISSN: ['0373-0956', '1777-5310']
DOI: https://doi.org/10.5802/aif.3371